منابع مشابه
Master/slave Speculative Parallelization and Approximate Code
This dissertation describes Master/Slave Speculative Parallelization (MSSP), a novel execution paradigm to improve the execution rate of sequential programs by parallelizing them speculatively for execution on a multiprocessor. In MSSP, one processor—the master—executes an approximate copy of the program to compute values the program’s execution is expected to compute. The master’s results are ...
متن کاملAdaptive Management of Bluetooth Slave/Slave Bridge
This paper discusses the minimization of end-to-end delays in a small Bluetooth scatternet with a Slave/Slave bridge. We assume that both piconets operate under exhaustive scheduling policy, that slaves generate packet bursts, that burst arrivals follow Poisson distribution, and that the size of packet bursts follows geometric distribution. Using the theory of queues with vacations, we investig...
متن کامل������������������������� � Master-Slave ������
近些年来,随着计算机的计算能力和存储能力的飞速发展,科学计算的规模越来越大,在气象、生物技术、 油藏模拟、核技术等领域,用于计算的网格已达到百万、千万乃至数十亿,计算的数据结果也已达到 GB 乃至 TB 大小。而和计算、存储技术的飞速发展相比,由于受材料、电子等工艺的限制,计算机的显示尺寸的发展相对滞 后。如何能够快速、准确的表现海量数据已经成为一个亟需解决的问题。它不仅包括如何以更大的屏幕来显示数 据,还包括如何以更快的速度来处理数据。 使用并行计算技术的大屏幕显示是解决上述问题一个很好的途径。采用多个显示设备取代原来的单个显示设 备使得显示屏幕增大为相应的倍数;各个显示设备由单独的计算机进行驱动,计算任务的分担使得显示速度也大 大提高。 除了在科学计算方面的应用外,大屏幕显示作为一种“半沉浸式”的虚拟环境,在虚拟战场、视频会议、公 共场合演示等方面也有着广泛的应用。 大屏幕显示技...
متن کاملA semi-systolic decoder for the PDSC-73 error-correcting code
This paper presents a semi-systolic architecture for decoding cyclic linear error-correcting codes at high speed. The architecture implements a variant of Tanner's Algorithm B, modified for simpler and faster implementation. The main features of the architecture are low computational complexity, a simple, regular arrangement of cells for easy layout, short critical paths, and a high clock rate....
متن کاملO -line and on-line scheduling on heterogeneous master-slave platforms
In this paper, we deal with the problem of scheduling independent tasks on heterogeneous master-slave platforms. We target both o -line and on-line problems, with several objective functions (makespan, maximum response time, total completion time). On the theoretical side, our results are two-fold: (i) For o line scheduling, we prove several optimality results for problems with release dates; (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fluminensia
سال: 2018
ISSN: 1848-9680,0353-4642
DOI: 10.31820/f.30.1.4